Adaptively Refined Meshes for Level Set function
نویسنده
چکیده
Level set functions are widely used for expressing implicit surfaces. In some cases, people are more interested in solution near the surface while global information is also required. The aim of this work is the development of an automatic, adaptive mesh refinement strategy for level set functions. Level set function is defined in adaptive space mesh grid with finer grids close to the surface. With the convection of level set function the mesh structure is modified to fit the requirement of varied surface. Advantages and disadvantages in such expression and extension of applications are discussed.
منابع مشابه
Load Balancing for Adaptively Refined Grids
The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an NP -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed....
متن کاملWavelets for adaptively refined -subdivision meshes
For view-dependent visualization, adaptively refined volumetric meshes are used to adapt resolution to given error constraints. A mesh hierarchy based on the -subdivision scheme produces structured grids with highest adaptivity. Downsampling filters reduce aliasing effects and lead to higher-quality data representation (in terms of lower approximation error) at coarser levels of resolution. We ...
متن کاملA Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries
Preliminary verification and validation of an efficient Euler solver for adaptively refined Carte-sian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The c...
متن کاملUniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems
Abstract In this paper we prove the uniform convergence of the standard multigrid V-cycle algorithm with Gauss-Seidel relaxation performed only on new nodes and their “immediate” neighbors for discrete elliptic problems on adaptively refined finite element meshes using the newest vertex bisection algorithm. The proof depends on sharp estimates on the relationship of local mesh sizes and a new s...
متن کاملSuperconvergence of a Quadratic Finite Element Method on Adaptively Refined Anisotropic Meshes
We establish in this paper the supercloseness of the quadratic finite element solution of a two dimensional elliptic problem to the piecewise quadratic interpolation of its exact solution. The assumption is that the partition of the solution domain is quasi-uniform under a Riemannian metric and that each pair of the adjacent elements in the partition forms an approximate parallelogram. This res...
متن کامل